A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes
نویسندگان
چکیده
We consider an undirected multi(commodity)flow demand problem in which a supply graph is planar, each source-sink pair is located on one of three specified faces of the graph, and the capacities and demands are integer-valued and Eulerian. It is known that such a problem has a solution if the cut and (2,3)-metric conditions hold, and that the solvability implies the existence of an integer solution. We develop a purely combinatorial strongly polynomial solution algorithm.
منابع مشابه
Half-integral Flows in a Planar Graph with Four Holes
Suppose that G = (1/G, EG) is a planar graph embedded in the euclidean plane, that I, J, K, 0 are four of its faces (called holes in G), that sl, , s,, t, , , t, are vertices of G such that each pair {si, ti} belongs to the boundary of some of I,J, K, 0, and that the graph (I/G, EGu{ {.slr fl}, ___ ,{.r,, t,}}) is eulerian. We prove that if the multi(commodity)flow problem in G with unit demand...
متن کاملFolder complexes and multiflow combinatorial dualities By Hiroshi
In multiflow maximization problems, there are several combinatorial duality relations, such as Ford-Fulkerson’s max-flow min-cut theorem for single commodity flows, Hu’s max-biflow min-cut theorem for two-commodity flows, Lovász-Cherkassky duality theorem for free multiflows, and so on. In this paper, we provide a unified framework for such multiflow combinatorial dualities by using the notion ...
متن کاملFolder Complexes and Multiflow Combinatorial Dualities
In multiflow maximization problems, there are several combinatorial duality relations, such as Ford-Fulkerson’s max-flow min-cut theorem for single commodity flows, Hu’s max-biflow min-cut theorem for two-commodity flows, Lovász-Cherkassky duality theorem for free multiflows, and so on. In this paper, we provide a unified framework for such multiflow combinatorial dualities by using the notion ...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملA dual descent algorithm for node-capacitated multiflow problems and its applications
In this paper, we develop an O((m log k)MSF(n,m, 1))-time algorithm to find a halfintegral node-capacitated multiflow of the maximum total flow-value in a network with n nodes, m edges, and k terminals, where MSF(n′,m′, γ) denotes the time complexity of solving the maximum submodular flow problem in a network with n′ edges, m′ edges, and the complexity γ of computing the exchange capacity of th...
متن کامل